A Course-Grid Pre-Processing based Load Balancing Scheme for Parallel Line Integral Convolution

نویسندگان

  • Jorji Nonaka
  • Koji Sakai
  • Koji Koyamada
  • Masanori Kanazawa
چکیده

Line Integral Convolution (LIC) has proven to be a very powerful visualization technique of vector data sets such as those obtained from numerical simulations. Despite its usefulness, this technique is notoriously computational intensive and is increasingly challenging as the amount of data continuously grows due to the advances in both computer hardware and software technology. Parallel processing is considered an effective approach for handling such large data sets, however it can suffer from workload imbalance depending on the distribution and orientation of the vectors elements in a given vector field. Specifically, elements on the boundary as well as close to the singularities (sources or sinks) have the potential for causing workload imbalance. In order to minimize this problem, we propose a load balancing scheme which adjusts the data partitioning based on the estimated workload obtained by coarsegrid LIC pre-processing. The partial results obtained from this pre-processing can be fully utilized in the next stages thus minimizing the pre-processing overhead. We obtained encouraging results showing the suitability of this load balancing scheme for parallel LIC which greatly contributes to the improvement of the visualization process of large vector data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Line Integral Convolution Algorithm for Visualizing Time-Varying Flow Fields

New challenges on vector field visualization emerge as time-dependent numerical simulations become ubiquitous in the field of computational fluid dynamics (CFD). To visualize data generated from these simulations, traditional techniques, such as displaying particle traces, can only reveal flow phenomena in preselected local regions and, thus, are unable to track the evolution of global flow fea...

متن کامل

Parleda: a Library for Parallel Processing in Computational Geometry Applications

ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...

متن کامل

Improving the Load Balancing Performance of Vlasiator

This whitepaper describes the load-balancing performance issues that are observed and tackled during the petascaling of the Vlasiator codes. Vlasiator is a Vlasov-hybrid simulation code developed in Finnish Meteorological Institute (FMI). Vlasiator models the communications associated with the spatial grid operated on as a hypergraph and partitions the grid using the parallel hypergraph partiti...

متن کامل

Investigation of Load Balancing Scalability in Space Plasma Simulations

This whitepaper describes the load-balancing performance issues that are observed and tackled during the petascaling of a space plasma simulation code developed at the Finnish Meteorological Institute (FMI). It models the communication pattern as a hypergraph, and partitions the computational grid using the parallel hypergraph partitioning scheme (PHG) of the Zoltan partitioning framework. The ...

متن کامل

A novel dynamic load balancing scheme for parallel systems

Adaptive mesh refinement (AMR) is a type of multiscale algorithm that achieves high resolution in localized regions of dynamic, multidimensional numerical simulations. One of the key issues related to AMR is dynamic load balancing (DLB), which allows large-scale adaptive applications to run efficiently on parallel systems. In this paper, we present an efficient DLB scheme for structured AMR (SA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005